Convergence of discrete and penalized least squares spherical splines
نویسندگان
چکیده
We study the convergence of discrete and penalized least squares spherical splines in spaces with stable local bases. We derive a bound for error in the approximation of a sufficiently smooth function by the discrete and penalized least squares splines. The error bound for the discrete least squares splines is explicitly dependent on the mesh size of the underlying triangulation. The error bound for the penalized least squares splines additionally depends on the penalty parameter. c ⃝ 2011 Elsevier Inc. All rights reserved.
منابع مشابه
Spherical Splines for Data Interpolation and Fitting
We study minimal energy interpolation, discrete and penalized least squares approximation problems on the unit sphere using nonhomogeneous spherical splines. Several numerical experiments are conducted to compare approximating properties of homogeneous and nonhomogeneous splines. Our numerical experiments show that nonhomogeneous splines have certain advantages over homogeneous splines.
متن کاملFitting Scattered Data on Sphere-like Surfaces Using Spherical Splines
Spaces of polynomial splines deened on planar triangulations are very useful tools for tting scattered data in the plane. Recently, 4, 5], using homogeneous polynomials, we have developed analogous spline spaces deened on triangulations on the sphere and on sphere-like surfaces. Using these spaces, it is possible to construct analogs of many of the classical interpolation and tting methods. Her...
متن کاملFitting Scattered Data on Sphere - LikeSurfaces using Spherical
Spaces of polynomial splines deened on planar triangulations are very useful tools for tting scattered data in the plane. Recently, 4, 5], using homogeneous polynomials, we have developed analogous spline spaces deened on triangulations on the sphere and on sphere-like surfaces. Using these spaces, it is possible to construct analogs of many of the classical interpolation and tting methods. Her...
متن کاملTwo-stage approximation methods with extended B-splines
We develop and analyze a framework for two-stage methods with EB-splines, applicable to continuous and discrete approximation problems. In particular, we propose a weighted discrete least squares fit that yields optimal convergence rates for sufficiently dense data on Lipschitz domains in Rd.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 163 شماره
صفحات -
تاریخ انتشار 2011